Extremely uniform branching programs
نویسندگان
چکیده
We propose a new descriptive complexity notion of uniformity for branching programs solving problems defined on structured data. We observe that FO[=]-uniform (n-way) branching programs are unable to solve the tree evaluation problem studied by Cook, McKenzie, Wehr, Braverman and Santhanam [8] because such programs possess a variant of their thriftiness property. Similarly, FO[=]-uniform (n-way) branching programs are unable to solve the Pcomplete GEN problem because such programs possess the incremental property studied by Gál, Koucký and McKenzie [10].
منابع مشابه
On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs
Branching programs are considered as a nonuniform model of computation in complexity theory as well as a data structure for boolean functions in several applications. In many applications (e. g., verification), exact representations are required. For learning boolean functions f on the basis of classified examples, it is sufficient to produce the representation of a function g approximating f ....
متن کاملBranching Program Uniformization, Rewriting Lower Bounds, and Geometric Group Theory
Geometric group theory is the study of the relationship between the algebraic, geometric, and combinatorial properties of finitely generated groups. Here, we add to the dictionary of correspondences between geometric group theory and computational complexity. We then use these correspondences to establish limitations on certain models of computation. In particular, we establish a connection bet...
متن کاملComplexity theoretical results for randomized branching programs
This work is settled in the area of complexity theory for restricted variants of branching programs. Today, branching programs can be considered one of the standard nonuniform models of computation. One reason for their popularity is that they allow to describe computations in an intuitively straightforward way and promise to be easier to analyze than the traditional models. In complexity theor...
متن کاملLecture 26 : PRGs from shrinkage
In the last lecture we showed that with high probability, a pseudorandom restriction ρ picked from an O(log n) wise independent distribution shrinks branching programs of size s. Today, we use this result as a black box to construct pseudorandom generators for branching programs. In fact we present a generic construction which works for any non-uniform computational model for which such a shrin...
متن کاملLinear Codes are Hard for Oblivious Read-Once Parity Branching Programs
We show that the characteristic functions of linear codes are exponentially hard for the model of oblivious read-once branching programs with parity accepting mode, known also as Parity OBDDs. The proof is extremely simple, and employs a particular combinatorial property of linear codes { their universality.
متن کامل